Admissible Bases Via Stable Canonical Rules

نویسندگان

  • Nick Bezhanishvili
  • David Gabelaia
  • Silvio Ghilardi
  • Mamuka Jibladze
چکیده

We establish the dichotomy property of [7] for multi-conclusion stable canonical rules of [1]. This yields an alternative proof of existence of bases of admissible rules for such well-known systems as IPC, S4, and K4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independent Bases of Admissible Rules

We show that IPC , K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules.

متن کامل

Bases of Admissible Rules of Lukasiewicz Logic

We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Lukasiewicz logic has no finite basis of admissible rules.

متن کامل

Canonical rules

We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC , by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in th...

متن کامل

Admissible Rules of Modal Logics

We construct explicit bases of admissible rules for a representative class of normal modal logics (including the systems K4, GL, S4, Grz, and GL.3), by extending the methods of S. Ghilardi and R. Iemhoff. We also investigate the notion of admissible multiple conclusion rules.

متن کامل

Preservation of Admissible Rules when Combining Logics

Admissible rules are shown to be conservatively preserved by the meetcombination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of the set of admissible rules are also shown to be preserved, the latter with no penalty on the time complexity. Examples are provided for the meet-combination ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 104  شماره 

صفحات  -

تاریخ انتشار 2016